Efficient fault tolerant Scheduling techniques And Backup Overloading techniques For Real Time System
نویسندگان
چکیده
To provide the performance analysis of off-line scheduling algorithms which address the issues of fault tolerance, reliability, real-time, task precedence constraints and heterogeneity in real time systems. The performance measures of these algorithms on which they are differentiated on each other are performance, reliability, schedulability. To compare the performance of backup overloading techniques based on fault tolerance dynamic scheduling algorithms in real time systems. These techniques are measured on the basis of fault rate, task load, task laxity and time to second failure. Keyword: Fault tolerant, Real Time System, Scheduling.
منابع مشابه
Efficient overloading techniques for primary-backup scheduling in real-time systems
In real-time systems, tasks have deadlines to be met despite the presence of faults. Primary-Backup (PB) scheme is one of the most important schemes that has been employed for fault-tolerant scheduling of real-time tasks, wherein each task has two versions and the versions are scheduled on two different processors with time exclusion. There have been techniques proposed for improving schedulabi...
متن کاملA New Fault-Tolerant Technique for Improving Schedulability in Multiprocessor Real-time Systems
In real-time systems, tasks have deadlines to be met despite the presence of faults. Primary-Backup (PB) scheme is one of the most common schemes that has been employed for fault-tolerant scheduling of real-time tasks, wherein each task has two versions and the versions are scheduled on two different processors with time exclusion. There have been techniques proposed for improving schedulabilit...
متن کاملA New Fault-Tolerant Technique for Improving the Schedulability in Multiprocessor Real-time Systems
In real-time systems, tasks have deadlines to be met despite the presence of faults. Primary-Backup (PB) scheme is one of the most common schemes that has been employed for fault-tolerant scheduling of real-time tasks, wherein each task has two versions and the versions are scheduled on two different processors with time exclusion. There have been techniques proposed for improving schedulabilit...
متن کاملEfficient Scheduling Algorithm with Fault-tolerance for Real-time Tasks in Distributed Systems
As real-time fault-tolerant scheduling is one of the main research areas in real-time fault-tolerant techniques, this paper proposes an efficient scheduling algorithm for BKCL(EBKCL). EBKCL can schedule the tasks with the fault-tolerant requirements(FTR) together with tasks without FTR. It is assumed in BKCL that there are no overlaps between the backup copies, however, the backup copies are al...
متن کاملA Fault-Tolerant Dynamic Scheduling Algorithm for Multiprocessor Real-Time Systems and Its Analysis
Many time-critical applications require dynamic scheduling with predictable performance. Tasks corresponding to these applications have deadlines to be met despite the presence of faults. In this paper , we propose an algorithm to schedule dynamically arriving real-time tasks with resource and fault-tolerant requirements on to multiprocessor systems. The tasks are assumed to be non-preemptable ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2016